#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve(){
    ll n,q;
    cin>>n>>q;
    vector<pair<ll,ll>> a(n,{0,0});
    for(int i=0;i<n;i++){
    	cin>>a[i].first;
    	a[i].second=a[i].first;
    }
    sort(a.begin(),a.end());
    for(int i=1;i<n;i++){
    	a[i].second=a[i].second+a[i-1].second;

    }
    while(q--){
    	ll b;
    	cin>>b;
    	ll l=-1,r=n-1;
    	while (l < r) {
    		ll mid = (l + r + 1) / 2; 
    		if (a[mid].first < b) {
		        l = mid;
		    } else {
		        r = mid-1;
		    }
		}
		while(l<n-1&&a[l+1].first<b){
			l++;
		}
		if(l==n-1){
			cout<<-1<<'\n';
			continue;
		}
		ll t1=l==-1?0:a[l].second;
		ll t2=(b-1)*(n-1-l);
		cout<<t1+t2+1<<'\n';
    }

}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}